Confluence Operators (JELIA'08)

نویسندگان

  • Sébastien Konieczny
  • Ramón Pino Pérez
چکیده

In the logic based framework of knowledge representation and reasoning many operators have been defined in order to capture different kinds of change: revision, update, merging and many others. There are close links between revision, update, and merging. Merging operators can be considered as extensions of revision operators to multiple belief bases. And update operators can be considered as pointwise revision, looking at each model of the base, instead of taking the base as a whole. Thus, a natural question is the following one: Are there natural operators that are pointwise merging, just as update are pointwise revision? The goal of this work is to give a positive answer to this question. In order to do that, we introduce a new class of operators: the confluence operators. These new operators can be useful in modelling negotiation processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Confluence Operators -- Negotiation as Pointwise Merging --

In the logic based framework of knowledge representation and reasoning many operators have been defined in order to capture different kinds of change: revision, update, merging and many others. There are close links between revision, update, and merging. Merging operators can be considered as extensions of revision operators to multiple belief bases. And update operators can be considered as po...

متن کامل

Characterizing D-WFS: Confluence and Iterated GCWA

Quite recently Brass/Dix have introduced the semantics D-WFS for general disjunctive logic programs. The interesting feature of this approach is that it is both semantically and proof-theoretically founded. Any program is associated a normalform res((), called the residual program. We show in this paper, that the original calculus, consisting of some simple transformations, has a very strong an...

متن کامل

Abstract Critical Pairs and Confluence of Arbitrary Binary Relations

Critical Pairs and Confluence of Arbitrary Binary Relations Rémy Haemmerlé and François Fages Projet Contraintes – INRIA Rocquencourt – France [email protected] Abstract. In a seminal paper, Huet introduced abstract properties of term rewriting systems, and the confluence analysis of terminating term rewriting systems by critical pairs computation. In this paper, we provide an abstrac...

متن کامل

Labeling techniques and typed fixed-point operators

Labeling techniques for untyped lambda calculus were developed by Lévy, Hyland, Wadsworth and others in the 1970’s. A typical application is the proof of confluence from finiteness of developments: by labeling each subterm with a natural number indicating the maximum number of times this term may participate in a reduction step, we obtain a strongly-normalizing approximation of β, η -reduction....

متن کامل

Opérateurs de Confluence

In the logic based framework of knowledge representation and reasoning many operators have been defined in order to capture different kinds of change : revision, update, merging and many others. There are close links between revision, update, and merging. Merging operators can be considered as extensions of revision operators to multiple belief bases. And update operators can be considered as p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008